Supporting Ranked Boolean Similarity Queries in MARS - Knowledge and Data Engineering, IEEE Transactions on

نویسندگان

  • Michael Ortega
  • Yong Rui
  • Kaushik Chakrabarti
  • Kriengkrai Porkaew
  • Sharad Mehrotra
  • Thomas S. Huang
چکیده

To address the emerging needs of applications that require access to and retrieval of multimedia objects, we are developing the Multimedia Analysis and Retrieval System (MARS) [29]. In this paper, we concentrate on the retrieval sulbsystem of MARS and its support for content-based queries over image databases. Content-based retrieval techniques have been extensively studied for textual documents in the area of automatic information retrieval [40], [4]. This paper describes how these techniques can be adapted for ranked retrieval over image databases. Specifically, we discuss the ranking and retrieval algorithms developed in MARS based on the Boolean retrieval model and describe the results of our experiments that demonstrate t h e effectiveness of the developed model for image retrieval.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supporting Ranked Boolean Similarity Queries in MARS

To address the emerging needs of applications that require access to and retrieval of multimedia objects we are developing the Multimedia Analysis and Retrieval System MARS in our group at the University of Illinois In this paper we concentrate on the retrieval subsystem of MARS and its support for content based queries over image databases Content based retrieval techniques have been extensive...

متن کامل

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1 Boolean Similarity Measures for Resource

| As the number of Internet servers increases rapidly, it becomes diicult to determine the relevant servers when searching for information. We develop a new method to rank Internet servers for Boolean queries. Our method reduces time and space complexity from exponential to polynomial in the number of Boolean terms. We contrast it with other known methods and describe its implementation.

متن کامل

In Ieee Transactions on Knowledge and Data Engineering

Searching over heterogeneous information sources is diicult because of the non-uniform query languages. Our approach is to allow a user to compose Boolean queries in one rich front-end language. For each user query and target source, we transform the user query into a subsuming query that can be supported by the source but that may return extra documents. The results are then processed by a lte...

متن کامل

Towards Supporting Exploratory Search over the Arabic Web Content: The Case of ArabXplore

Due to the huge amount of data published on the Web, the Web search process has become more difficult, and it is sometimes hard to get the expected results, especially when the users are less certain about their information needs. Several efforts have been proposed to support exploratory search on the web by using query expansion, faceted search, or supplementary information extracted from exte...

متن کامل

Precision and Recall of RankingInformation - Filtering

An information-ltering system collects incoming data of speciic interests described in a server proole. These systems can export their collections by submitting their prooles to a directory server, where users can query for relevant systems to answer their requests. We develop a new similarity measure to rank information-ltering systems for Boolean queries. Users can send queries to the top-ran...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009